Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
331	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Hamilton Circuits in Hexagonal Grid Graphs Kamrul Islam(1) (1) Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:51 Hamiltonian path Graph coloring Graph Path decomposition Edge coloring Graph theory Planar graphs NP-complete problems
332	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Packing Plane Spanning Trees and Paths in Complete Geometric Graphs∗ Oswin Aichholzer† Thomas Hackl† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 19:34:00 Spanning tree Matroid theory Tree Planar graph Graph Geometric graph theory Matching Minimum spanning tree Petersen graph Graph theory Mathematics Theoretical computer science
333	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics
334	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory
335	16th Canadian Conference on Computational Geometry, 2004 On Sequential Triangulations of Simple Polygons Robin Flatland Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 NP-complete problems Hamiltonian path Vertex Triangle strip Degree Graph theory Mathematics Theoretical computer science
336	IEEE International Conference on Data Engineering Progressive Keyword Search in Relational Databases Guoliang Li† † Add to Reading List Source URL: dbgroup.cs.tsinghua.edu.cn Language: English - Date: 2012-01-09 09:42:51 Spanning tree NP-complete problems Network theory Steiner tree problem Minimum spanning tree Connectivity Tree Graph Shortest path problem Graph theory Theoretical computer science Mathematics
337	CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:18 NP-complete problems Graph coloring Domatic number Dominating set Independent set Greedy coloring Topology Maximal independent set Graph Graph theory Theoretical computer science Mathematics
338	Journal of Machine Learning Research vol–23 Submitted 24 May 2012; Published 2012 Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2012-06-05 15:17:28 Algebraic graph theory NP-complete problems Graph partition Laplacian matrix Degree Random graph Laplace operator Adjacency matrix Tutte polynomial Mathematics Graph theory Mathematical analysis
339	CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Hypergraph Combinatorics Vertex cover Graph Incidence matrix Planar graph Path decomposition Line graph Graph theory Mathematics NP-complete problems
340	CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Hamiltonian path Vertex cover Independent set Matching Minimum spanning tree Dominating set Graph coloring Theoretical computer science Graph theory Mathematics

UPDATE